Optimization of the Kinetic Activation-Relaxation Technique, an off-lattice and self-learning kinetic Monte-Carlo method
نویسندگان
چکیده
منابع مشابه
Approximating Off-Lattice Kinetic Monte Carlo
We present an approximate off-lattice kinetic Monte Carlo (KMC) method for simulating heteroepitaxial growth. The model aims to retain the speed and simplicity of lattice based KMC methods while capturing essential features that can arise in an off-lattice setting. Interactions between atoms are defined by an interatomic potential which determines the arrangement of the atoms. In this formulati...
متن کاملSelf-learning kinetic Monte Carlo method: Application to Cu(111)
We present a method of performing kinetic Monte Carlo simulations that does not require an a priori list of diffusion processes and their associated energetics and reaction rates. Rather, at any time during the simulation, energetics for all possible singleor multiatom processes, within a specific interaction range, are either computed accurately using a saddle-point search procedure, or retrie...
متن کاملOff-lattice pattern recognition scheme for kinetic Monte Carlo simulations
We report the development of a pattern-recognition scheme for the off-lattice self-learning kinetic Monte Carlo (KMC) method, one that is simple and flexible enough that it can be applied to all types of surfaces. In this scheme, to uniquely identify the local environment and associated processes involving three-dimensional (3D) motion of an atom or atoms, space around a central atom is divided...
متن کاملKinetic activation-relaxation technique.
We present a detailed description of the kinetic activation-relaxation technique (k-ART), an off-lattice, self-learning kinetic Monte Carlo (KMC) algorithm with on-the-fly event search. Combining a topological classification for local environments and event generation with ART nouveau, an efficient unbiased sampling method for finding transition states, k-ART can be applied to complex materials...
متن کاملIntroduction to the Kinetic Monte Carlo Method
Monte Carlo refers to a broad class of algorithms that solve problems through the use of random numbers. They first emerged in the late 1940’s and 1950’s as electronic computers came into use [1], and the name means just what it sounds like, whimsically referring to the random nature of the gambling at Monte Carlo, Monaco. The most famous of the Monte Carlo methods is the Metropolis algorithm [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2012
ISSN: 1742-6596
DOI: 10.1088/1742-6596/341/1/012007